Quasirandomness and Regularity: Lecture Notes Iv

نویسنده

  • JOSHUA N. COOPER
چکیده

One of the most beautiful, and useful, areas in which quasirandomness has been studied concerns the subsets of the (rational) integers modulo n, which we write Zn. We need a few items of notation before introducing the random-like properties we are interested in. First of all, for x ∈ Zn, let en(x) = e. When n is understood, we simply write e(x). Then, for a subset S ⊂ Zn, let the function χS : Zn → {0, 1} denote the characteristic function of S, i.e., χS(x) = 0 if x 6∈ S and 1 otherwise. Also, S + t = {s + t : s ∈ S}, and #(S ⊂ T ) = |{x : S + x ⊂ T}|, or, informally, the “number of copies of S in T .” Note that #(S ⊂ T ) = | ⋂ u∈S(T − u)|. Finally, we define GS to be the graph with vertex set Zn so that {i, j} ∈ E(GS) iff i + j ∈ S. The following are our quasirandom properties for the “ambient set” S ⊂ Zn with cardinality s = |S|. Where a “test set” T is involved, t denotes the cardinality of T .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasirandomness and Regularity: Lecture Notes I

The idea behind quasirandomness is that many random-like properties of combinatorial objects are equivalent, although they often do not appear to be so on first glance. We begin with the first class to which this notion was applied, and perhaps the most studied of combinatorial objects, graphs. It is easy to show that each of the following properties are true with probability 1 of a uniformly c...

متن کامل

Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results gives a new proof of a theorem of Frankl and Rödl, of which Szemerédi’s theorem for arithmetic progressions of length 4 is a notable consequence. Frankl and Rödl also prove regularity and counting lemmas, but the proofs here, and even the statements, are significantly d...

متن کامل

Factors affecting students tendency of Univercity students to Lecture Notes

Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...

متن کامل

Advanced Algorithms Lecture Notes

Preface This is a set of lecture notes for the 3rd year course " Advanced Algorithms " which I gave in Tsinghua University for Yao-class students in the Spring and Fall terms in 2011. This set of notes is partially based on the notes scribed by students taking the course the first time it was given. Many thanks to Xiahong Hao and Nathan Hobbs for their hard work in critically revising, editing,...

متن کامل

Lecture notes based on Foundations of Mathematical Economics c ⃝ 2001

We derived the Kuhn-Tucker theorem by assuming regularity of the binding constraints. With the possibility of corner solutions, regularity is too stringent. The regularity condition will not necessarily apply throughout the constraint set. Verifying the regularity condition requires knowing the optimal solution, but the first-order conditions will not identify the optimal solution unless the re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009